Multiple query probabilistic roadmap planning using single query planning primitives
نویسندگان
چکیده
We propose a combination of techniques that solve multiple queries for motion planning problems with single query planners. Our implementation uses a probabilistic roadmap method (PRM) with bidirectional rapidly exploring random trees (BI-RRT) as the local planner. With small modifications to the standard algorithms, we obtain a multiple query planner which is significantly faster and more reliable than its component parts. Our method provides a smooth spectrum between the PRM and BI-RRT techniques and obtains the advantages of both. We observed that the performance differences are most notable in planning instances with several rigid nonconvex robots in a scene with narrow passages. Our work is in the spirit of non-uniform sampling and refinement techniques used in earlier work on PRM.
منابع مشابه
Probabilistic Roadmaps of Trees for Parallel Computation of Multiple Query Roadmaps
We propose the combination of techniques that solve multiple queries for motion planning problems with single query planners in a motion planning framework that can be efficiently parallelized. In multiple query motion planning, a data structure is built during a preprocessing phase in order to quickly respond to on-line queries. Alternatively, in single query planning, there is no preprocessin...
متن کاملLazy Toggle PRM: An Efficient Motion Planning Strategy for Task Sequences
Probabilistic RoadMaps (PRMs) are quite successful in solving complex and high-dimensional motion planning problems. While particularly suited for multiple-query scenarios and expansive spaces, they lack efficiency in both solving a small number of queries in an environment and mapping narrow spaces. Two PRM variants separately tackle these gaps. Lazy PRM reduces the computational cost of roadm...
متن کاملReactive Motion Planning for Mobile Robots
Motion planning refers to the ability of a system to automatically plan its motions. It is considered central to the development of autonomous robots. In the last decade, much research effort was done on the application of probabilistic roadmaps methods (PRM) for different types of problems (Kavraki et al., 1996; Svestka & Overmars, 1997; Bohlin & Kavraki, 2000; Sánchez & Latombe, 2002). There ...
متن کاملRESAMPL: A Region-Sensitive Adaptive Motion Planner
Automatic motion planning has applications ranging from traditional robotics to computer-aided design to computational biology and chemistry. While randomized planners, such as probabilistic roadmap methods (prms) or rapidlyexploring random trees (rrt), have been highly successful in solving many high degree of freedom problems, there are still many scenarios in which we need better methods, e....
متن کاملA Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the two input query configurations to explore as little space as possible; (2) bi-directional i.e., it searches the robot’s free space by concurrently building a roadmap made of two trees rooted at the query configurations –...
متن کامل